Maximum-throughput Scheduling with Limited Resources for Iterative Data-flow Graphs by Means of the Scheduling-range Chart
نویسندگان
چکیده
This paper describes a technique for obtaining maximumthroughput schedules for iterative data-flow graphs, given a limited set of resources. The method is based on the use of the scheduling-range chart, where the scheduling window of each operation is displayed. This scheduling window, or scheduling range, is relative to a reference operation, and can be finite or infinite. The information in the schedulingrange chart is used during scheduling in order to optimize the sampling period. An algorithm based on this approach, for scheduling of acyclic as well as cyclic data-flow graphs, is presented.
منابع مشابه
Stability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid
Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملIntelligent scheduling for emergency room(ER) personnel to improve productivity
Improving productivity in emergency services and managing limited resources of emergency room(ER) are key challenges for health managers of oil industry. One critical and costly resource is ER personnel and its lack can lead to long queue of patients. Thus appropriate scheduling for nurses and physicians can help ER managers to get maximum benefit of their current human resource and reduce th...
متن کاملOptimum Aggregate Inventory in the Lot Scheduling Problem with Non-Zero Setup Time
In this paper, the minimization of the maximum aggregate inventory of all products for the common cycle time approach to the scheduling problem of a multi-products single machine system is considered. In the case of non-zero set up time and limited resources, a simply and easy to apply rule has been obtained for this optimization problem. Using this rule, one can obtain the optimal production s...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004